Editorial: Stringology Algorithms

Randomization in Parallel Stringology

In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching falls into two categories: standard stringology and nonstandard stringology. Standard Stringology concerns the study of various exact matching problems. The fundamental problem here is the basic string matching problem ...

Correctness-by-Construction in Stringology

Correctness-by-construction (CbC) is an algorithm derivation technique in which the algorithm is co-developed with its correctness proof. Starting with a specification (most often as a preand post-condition), ‘derivation steps’ are made towards a final algorithm. Critically, each step in the derivation is a correctness-preserving one, meaning that the composition of the derivation steps is the ...

A Formal Framework for Stringology

A new formal framework for Stringology is proposed, which consists of a three-sorted logical theory S designed to capture the combinatorial reasoning about finite words. A witnessing theorem is proven which demonstrates how to extract algorithms for constructing strings from their proofs of existence. Various other applications of the theory are shown. The long term goal of this line of researc...

Editorial Bioinformatics Algorithms and Genomics

The Human Genome Project was completed in April 2003 [1]. All of the 3.2 billion base pairs in the entire human genome have been sequenced in this project. The Human Genome Project is a revolutionizing biological and medical research [2]. However, it was just the starting point for us to understand the function of our genome. Extraordinary amount of information generated from the Human Genome P...

The finite automata approaches in stringology